全文获取类型
收费全文 | 298篇 |
免费 | 189篇 |
国内免费 | 19篇 |
出版年
2024年 | 1篇 |
2023年 | 7篇 |
2022年 | 7篇 |
2021年 | 11篇 |
2020年 | 14篇 |
2019年 | 9篇 |
2018年 | 18篇 |
2017年 | 29篇 |
2016年 | 35篇 |
2015年 | 26篇 |
2014年 | 47篇 |
2013年 | 39篇 |
2012年 | 35篇 |
2011年 | 27篇 |
2010年 | 16篇 |
2009年 | 25篇 |
2008年 | 31篇 |
2007年 | 29篇 |
2006年 | 26篇 |
2005年 | 21篇 |
2004年 | 7篇 |
2003年 | 6篇 |
2002年 | 11篇 |
2001年 | 9篇 |
2000年 | 3篇 |
1999年 | 2篇 |
1998年 | 3篇 |
1996年 | 1篇 |
1995年 | 4篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 2篇 |
排序方式: 共有506条查询结果,搜索用时 250 毫秒
11.
针对以常规母联开关互联的交流电网线路变压器容量无法合理利用的问题,提出了依靠由背靠背电压源变流器组成的新型大功率柔性互联装置实现两侧交流电网有功功率互济的协调控制方法。介绍了新型柔性互联装置的拓扑结构与基本的控制原理,为实现两侧线路变压器容量合理的目标制定了一种生成有功功率参考的方法,并基于PSCAD/EMTDC搭建了一套仿真算例,对新型柔性互联装置的基本控制与所提出的有功互济的协调控制方法进行了验证。仿真结果表明,在柔性互联装置采用所提方法时能够实现两侧交流线路的有功功率互济,解决了线路变压器容量无法合理分配的问题。 相似文献
12.
A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem
The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
13.
14.
A. Garnaev 《海军后勤学研究》2007,54(1):109-114
This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λi (μi) for Player 1 (Player 2) such that pi(1 ? exp(?λixi)) (pi(1 ? exp(?μiyi))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort xi (yi) applied at point i where pi ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q1 and Player 2 gets q2 where q1 + q2 ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
15.
In this paper we consider the capacitated multi‐facility Weber problem with the Euclidean, squared Euclidean, and ?p‐distances. This problem is concerned with locating m capacitated facilities in the Euclidean plane to satisfy the demand of n customers with the minimum total transportation cost. The demand and location of each customer are known a priori and the transportation cost between customers and facilities is proportional to the distance between them. We first present a mixed integer linear programming approximation of the problem. We then propose new heuristic solution methods based on this approximation. Computational results on benchmark instances indicate that the new methods are both accurate and efficient. © 2006 Wiley Periodicals, Inc. Naval Research Logistics 2006 相似文献
16.
Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
17.
18.
大地水准面对双星定位精度影响研究 总被引:1,自引:0,他引:1
讨论了双星定位的4种定位计算方法,研究大地水准面对双星定位精度影响规律,并与采用参考椭球模型得到的定位坐标值进行比较,在北纬20~30°区域,海面高度变化为4 m时,北斗定位精度的变化约为8 m.证明大地水准面对双星定位精度有较大的影响,考虑潮汐等海面因素能有效提高双星定位精度. 相似文献
19.
基于离散降雨衰耗状态的卫星信道模型 总被引:1,自引:0,他引:1
针对Ka频段卫星信道中降雨衰耗的统计分布特点,建立了基于离散降雨衰耗状态的卫星信道模型,模型中各状态组成离散的Markov链并由其转移概率矩阵来表示,分析此模型下的信道误比特性能和数据包丢失性能。此模型能够适用于链路层以及高层通信协议。 相似文献
20.
区域防空导弹反导火力分配研究 总被引:1,自引:0,他引:1
分析了传统防空导弹火力分配模型的不足,考虑到编队内各舰艇近程防空作战能力的不同,结合装备性能特点,建立了基于机会约束规划的区域防空导弹火力分配优化模型。给出了基于遗传算法和BP神经网络的混合智能算法,该算法在精度和速度上均能满足防空作战的要求。 相似文献